Complexity of Strategic Behavior in Multi-Winner Elections
نویسندگان
چکیده
Although recent years have seen a surge of interest in the computational aspects of social choice, no specific attention has previously been devoted to elections with multiple winners, e.g., elections of an assembly or committee. In this paper, we characterize the worst-case complexity of manipulation and control in the context of four prominent multiwinner voting systems, under different formulations of the strategic agent’s goal.
منابع مشابه
A broader picture of the complexity of strategic behavior in multi-winner elections
Recent work by Procaccia, Rosenschein and Zohar [14] established some results regarding the complexity of manipulation and control in elections with multiple winners, such as elections of an assembly or committee; that work provided an initial understanding of the topic. In this paper, we paint a more complete picture of the topic, investigating four prominent multi-winner voting rules. First, ...
متن کاملMulti-Winner Elections: Complexity of Manipulation, Control and Winner-Determination
Although recent years have seen a surge of interest in the computational aspects of social choice, no attention has previously been devoted to elections with multiple winners, e.g., elections of an assembly or committee. In this paper, we fully characterize the worst-case complexity of manipulation and control in the context of four prominent multi-winner voting systems. Additionally, we show t...
متن کاملApproval Voting on Large Poisson Games ∗
Approval Voting is analyzed in a context of large elections with strategic voters, the Myerson’s Large Poisson Games. Three examples show that this voting rule does not always correctly aggregate preferences. The first one shows that a candidate ranked first by more than half of the voters need not be the Winner of the election under Approval voting. In the second one, we show that it can be th...
متن کاملStrategic voting in multi-winner elections with approval balloting: a theory for large electorates
We propose a theory of strategic voting in multi-winner elections with approval balloting: A fixed number of candidates are to be elected; each voter votes for as many candidates as she wants; the candidates with the most votes are elected. We assume that voter preferences are separable and that there exists a tiny probability that any vote might be misrecorded. Best responses involve votin...
متن کاملA Complexity-of-Strategic-Behavior Comparison between Schulze's Rule and Ranked Pairs
Schulze’s rule and ranked pairs are two Condorcet methods that both satisfy many natural axiomatic properties. Schulze’s rule is used in the elections of many organizations, including the Wikimedia Foundation, the Pirate Party of Sweden and Germany, the Debian project, and the Gento Project. Both rules are immune to control by cloning alternatives, but little is otherwise known about their stra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Artif. Intell. Res.
دوره 33 شماره
صفحات -
تاریخ انتشار 2008